منابع مشابه
Learning Discriminative Projections for Text Similarity Measures
Traditional text similarity measures consider each term similar only to itself and do not model semantic relatedness of terms. We propose a novel discriminative training method that projects the raw term vectors into a common, low-dimensional vector space. Our approach operates by finding the optimal matrix to minimize the loss of the pre-selected similarity function (e.g., cosine) of the proje...
متن کاملSimilarity of symbolic sequences
A new numerical characterization of symbolic sequences is proposed. The partition of sequence based on Ke and Tong algorithm is a starting point. Algorithm decomposes original sequence into set of distinct subsequences a patterns. The set of subsequences common for two symbolic sequences (their intersection) is proposed as a measure of similarity between them. The new similarity measure works w...
متن کاملApproximating Sequences and Bidual Projections
SINCE the appearance of Enflo's negative solution to the approximation problem [3], only a few positive general results on the approximation properties have been obtained. However, it is shown in [2] that any separable Banach space with the metric approximation property (M.A.P.) has the commuting metric approximation property. More precisely, if X has (MAP) there exists a sequence {Rn} of finit...
متن کاملA computational method to analyze the similarity of biological sequences under uncertainty
In this paper, we propose a new method to analyze the difference and similarity of biological sequences, based on the fuzzy sets theory. Considering the sequence order and some chemical and structural properties, we present a computational method to cluster the biological sequences. By some examples, we show that the new method is relatively easy and we are able to compare the sequences of arbi...
متن کاملNormalized Similarity of RNA Sequences
We introduce a normalized version of the LCS metric as a new local similarity measure for comparing two RNAs. An O(n2m lgm) time algorithm is presented for computing the maximum normalized score of two RNA sequences, where n and m are the lengths of the sequences and n ≤ m. This algorithm has the same time complexity as the currently best known global LCS algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1967
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1967-11836-6